In this paper, HZSM5 zeolite was synthesized through reflux method on support material CaO (25, 35 and 45 wt%) in two specific methods: microwave and impregnation at high temperature. The zeolite catalyst was modified with impregnation of NaOH (2, 4, 8, 12 wt%) at room temperature. The modified zeolite was used in transesterification of rapeseed oil with methanol in abatch catalytic process. In transesterification of rapeseed oil, the catalyticactivities of HZSM5, NaZSM5, KZSM5 were considered. The prepared catalysts were characterized by several techniques such as X-ray diffraction (XRD), Brunauer Emmett Teller (BET) surface area and also the surface image was scanned by scanning electron microscopy (SEM). The parameters affecting on biodiesel yield at optimum reaction conditions were investigated. The maximum yield was achieved with 8wt% of NaOH loaded on HZSM5 at reaction temperature of 65˚ C, reaction time of 12 hours and catalyst/oil mass ratio of 9. Also the yield of CaO loaded with impregnation at high temperature was more desired than CaO loaded with microwave. Meanwhile the catalytic activity of HZSM5, NaZSM5 and KZSM5 was nearly zero; and the catalytic activity of modified zeolite was HZSM5>NaZSM5>KZSM5 subsequently.

A category C is called Cartesian closed provided that it has  nite products and for each C-object A the functor (A  􀀀 ): A! A has a right adjoint. It is well known that the category TopFuzz of all topological fuzzes is both complete and cocomplete, but it is not Cartesian closed. In this paper, we introduce some Cartesian closed subcategories of this category.

For the solution of a variety of problems which concern molecular structures, it is often necessary to calculate the Cartesian coordinates of the atoms from a set of geometric parameters. In order to fully utilize symmetry operations in the calculation of Cartesian coordinates, it is necessary to construct the molecule within a primary coordinate system. This is accomplished by introducing a set of four dummy atoms, by which unit vectors are specified. One atom is placed at the origin and the others at unit distances along each of the three Cartesian axes. in this framework according to the attachment procedures described below. The atoms of a molecule are positioned through the use of a secondary coordinate system. A base coordinate system is defined by the positions of three atoms, numbered 1, 2, and 3. The origin is taken at Atom 1, the negative x-axis passes through Atom 2, and Atom 3 lies in the first or second quadrant of the xy plane. In order to define the angles, the following conventions are adopted: for a general atom j, the atom to which it was attached is called $j^{\prime}$, and the atom to which $j^{\prime}$ was attached is called $j^{\prime \prime}$, and the atom to which $j^{\prime \prime}$ was attached is called $j^{\prime \prime \prime}$. Two special cases where these definitions do not suffice are atoms attached to Atom 1 and to Atom 2. Where j is attached to Atom 2, Atom 1 is taken as $j^{\prime \prime}$ and Atom 3 as $j^{\prime \prime \prime}$. Where j is attached to Atom 1, Atom 2 is taken as $j^{\prime \prime}$ and Atom 3 as $j^{\prime \prime \prime}$. The program described is being used extensively for specifying molecular structures for electron diffraction investigations. Other current uses are in programs for x-ray diffraction of polymers, for estimating magnitudes of energy via postulated force field functions, and in molecular orbital calculations.

A subset $S$ of vertices of a graph $G$ is in general position if no shortest path in $G$ contains three vertices of $S$. The general position problem consists of finding the number of vertices in a largest general position set of $G$, whilst the lower general position problem asks for a smallest maximal general position set. In this paper we determine the lower general position numbers of several families of Cartesian products. We also show that the existence of small maximal general position sets in a Cartesian product is connected to a special type of general position set in the factors, which we call a terminal set, for which adding any vertex $u$ from outside the set creates three vertices in a line with $u$ as an endpoint. We give a constructive proof of the existence of terminal sets for graphs with diameter at most three. We also present conjectures on the existence of terminal sets for all graphs and a lower bound on the lower general position number of a Cartesian product in terms of the lower general position numbers of its factors.